Spanning forests in regular planar maps

نویسندگان

  • Mireille Bousquet-Mélou
  • Julien Courtiel
چکیده

We address the enumeration of p-valent planar maps equipped with a spanning forest, with a weight z per face and a weight u per connected component of the forest. Equivalently, we count p-valent maps equipped with a spanning tree, with a weight z per face and a weight μ := u + 1 per internally active edge, in the sense of Tutte; or the (dual) p-angulations equipped with a recurrent sandpile configuration, with a weight z per vertex and a variable μ := u+1 that keeps track of the level of the configuration. This enumeration problem also corresponds to the limit q → 0 of the q-state Potts model on p-angulations. Our approach is purely combinatorial. The associated generating function, denoted F (z, u), is expressed in terms of a pair of series defined implicitly by a system involving doubly hypergeometric series. We derive from this system that F (z, u) is differentially algebraic in z, that is, satisfies a differential equation in z with polynomial coefficients in z and u. This has recently been proved to hold for the more general Potts model on 3-valent maps, but via a much more involved and less combinatorial proof. For u ≥ −1, we study the singularities of F (z, u) and the corresponding asymptotic behaviour of its nth coefficient. For u > 0, we find the standard asymptotic behaviour of planar maps, with a subexponential term in n−5/2. At u = 0 we witness a phase transition with a term n−3. When u ∈ [−1, 0), we obtain an extremely unusual behaviour in n−3(lnn)−2. To our knowledge, this is a new “universality class” for planar maps.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Spanning forests in regular planar maps (conference version)

We address the enumeration of p-valent planar maps equipped with a spanning forest, with a weight z per face and a weight u per component of the forest. Equivalently, we count regular maps equipped with a spanning tree, with a weight z per face and a weight μ := u+ 1 per internally active edge, in the sense of Tutte. This enumeration problem corresponds to the limit q → 0 of the q-state Potts m...

متن کامل

Hyperbolic and Parabolic Unimodular Random Maps Omer Angel Tom Hutchcroft Asaf Nachmias Gourab Ray

We show that for infinite planar unimodular random rooted maps, many global geometric and probabilistic properties are equivalent, and are determined by a natural, local notion of average curvature. This dichotomy includes properties relating to amenability, conformal geometry, random walks, uniform and minimal spanning forests, and Bernoulli bond percolation. We also prove that every simply co...

متن کامل

Hyperbolic and Parabolic Unimodular Random Maps Omer Angel Tom Hutchcroft Asaf Nachmias Gourab Ray

We show that for infinite planar unimodular random rooted maps, many global geometric and probabilistic properties are equivalent, and are determined by a natural, local notion of average curvature. This dichotomy includes properties relating to amenability, conformal geometry, random walks, uniform and minimal spanning forests, and Bernoulli bond percolation. We also prove that every simply co...

متن کامل

Decomposing 4-connected planar triangulations into two trees and one path

Refining a classical proof of Whitney, we show that any 4-connected planar triangulation can be decomposed into a Hamiltonian path and two trees. Therefore, every 4-connected planar graph decomposes into three forests, one having maximum degree at most 2. We use this result to show that any Hamiltonian planar triangulation can be decomposed into two trees and one spanning tree of maximum degree...

متن کامل

Edge-disjoint Spanning Trees in Triangulated Graphs on Surfaces and application to node labeling

In 1974, Kundu [4] has shown that triangulated (or maximal) simple toroidal graphs have three edge-disjoint spanning trees. We extend this result by showing that a triangulated graph on an orientable surface of genus g has at least three edge-disjoint spanning trees and so we can partition the edges of graphs of genus g into three forests plus a set of at most 6g − 3 edges.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • J. Comb. Theory, Ser. A

دوره 135  شماره 

صفحات  -

تاریخ انتشار 2015